Arranging Numbers on Circles to Reach Maximum Total Variations
نویسندگان
چکیده
The dartboard problem is to arrange n numbers on a circle to obtain maximum risk, which is the sum of the q-th power of the absolute differences of adjacent numbers, for q ≥ 1. Curtis showed that the dartboard problem admits a greedy algorithm. We generalize the dartboard problem by considering more circles and the goal is to arrange kn number on k circles to obtain the maximum risk. In this paper, we characterize an optimal arrangement for k = 2 and show that the generalized dartboard problem also admits a greedy algorithm.
منابع مشابه
Quaternionic Product of Circles and Cycles and Octonionic Product for Pairs of Circles
This paper concerns with a product of circles induced by the quaternionic product considered in a projective manner. Several properties of this composition law are derived and on this way we arrive at some special numbers as roots or powers of unit. We extend this product to cycles as oriented circles and to pairs of circles by using the algebra of octonions. Three applications of the given pro...
متن کاملTechnical Report Variational Circle Packing Based on Power Diagram
Circle packing aims at arranging multiple circles in the smallest container with a fixed shape, without overlapping between any two circles. Existing methods either solve it by minimizing the size of the container continuously or find an approximate smallest container by combinatorial optimization. Various approaches are proposed to handle different shapes of containers. In this paper, we gener...
متن کاملInvestigating the Effects of Electric Vehicle with Maximum Power Point Tracking Algorithm on Power System
Abstract: As fuel prices increase and environmental issues become more serious due to the use of fossil fuels, as well as the expiration of fossil fuels, the researchers are looking to find alternative fossil fuels. Using renewable and green energy like solar energy using photovoltaic systems would be a convenient and cost-effective way. It is important to note that the efficiency of these cell...
متن کاملMaximum line-pair stabbing problem and its variations
We study the Maximum Line-Pair Stabbing Problem: Given a planar point set S, find a pair of parallel lines within distance 6 from each others such that the number of points of S that intersect (stab) the area in between the two lines is maximized. There exists an algorithm that computes maximum stabbing in O(|S|2) time and space. We give a more space-efficient solution; the time complexity incr...
متن کاملInserting Points Uniformly at Every Instance
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this paper we generalize this problem in such a way that points be inserted one by one with uniformity preserved at every instance. Our criteria on uniformity is to minimize the gap ratio (which is the maximum gap over the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 14 شماره
صفحات -
تاریخ انتشار 2007